XT (overlapping term) - перевод на Английский
Diclib.com
Словарь онлайн

XT (overlapping term) - перевод на Английский

Overlapping subproblem

overlapping2      
(adj.) = cuyos cometidos se solapan, que se solapan
Ex: Interpretation and re-interpretation take place not in isolation, but in the context of overlapping social agencies.
----
* XT (overlapping term) = TX (término que solapa a otro en el significado)
PC XT         
  • IBM PC/XT 5160 dual floppy drives with 5153 Color Monitor
PERSONAL COMPUTER MODEL
IBM PC-XT; PC/XT; PC XT; PC-XT; IBM XT; XT class; IBM/XT; IBM 5160 Personal Computer XT; IBM 5160; IBM 5162 Personal Computer XT/286; IBM PC/XT; XT Computer; IBM XT 286; IBM PC XT; IBM model 5160; 286 XT; IBM PC 5160; IBM Personal Computer/XT; IBM 5162; XT clones
PC-XT (computadora de procesador 8088)
term of office         
  • 400px
  • 400px
  • 400px
TIME LIMIT FOR A POLITICIAN HOLDING A GIVEN POSITION (SOMETIMES RENEWABLE)
Office term; Term in office; Election cycle; Term length; Term (politics); Electoral term; Parliamentary term
(n.) = mandato, legislatura
Ex: At the same time we traditionally record the departure of those who have completed terms of office and who have given much of their time and some of their lives to forwarding the cause of libraries and librarianship.

Определение

IBM PC XT
<computer> An IBM PC with a (slow) hard disk. The XT was released in March 1983. It had an Intel 8088 CPU. The XT/370, released in October 1983, added IBM 370 mainframe emulation, and the XT 286 followed in September 1986 with an Intel 80286 CPU [Why?]. (1996-05-21)

Википедия

Overlapping subproblems

In computer science, a problem is said to have overlapping subproblems if the problem can be broken down into subproblems which are reused several times or a recursive algorithm for the problem solves the same subproblem over and over rather than always generating new subproblems.

For example, the problem of computing the Fibonacci sequence exhibits overlapping subproblems. The problem of computing the nth Fibonacci number F(n), can be broken down into the subproblems of computing F(n − 1) and F(n − 2), and then adding the two. The subproblem of computing F(n − 1) can itself be broken down into a subproblem that involves computing F(n − 2). Therefore, the computation of F(n − 2) is reused, and the Fibonacci sequence thus exhibits overlapping subproblems.

A naive recursive approach to such a problem generally fails due to an exponential complexity. If the problem also shares an optimal substructure property, dynamic programming is a good way to work it out.